Boundedness of Monadic FO over Acyclic Structures
نویسندگان
چکیده
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very restricted classes of underlying first-order formulae, we here obtain a decidability result for the boundedness issue for monadic fixed points over arbitrary first-order formulae in restriction to acyclic structures.
منابع مشابه
On the Boundedness Problem for Two-Variable First-Order Logic
A positive rst-order formula is bounded if the sequence of its stages converges to the least xed point of the formula within a xed nite number of steps independent of the input structure. The boundedness problem for a fragment L of rst-order logic is the following decision problem: given a positive formula in L, is it bounded? In this paper, we investigate the boundedness problem for two-variab...
متن کاملBoundedness of Monadic Second-Order Formulae over Finite Words
We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
متن کاملUndecidable First-Order Theories of Affine Geometries
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (β) and a quaternary equidistance relation (≡). Tarski established, inter alia, that the first-order (FO) theory of (R2, β,≡) is decidable. Aiello and van Benthem (2002) conjectured that the FO-theory of expansions of (R2, β) with unary predicates is decidable. We r...
متن کاملDecidability Results for the Boundedness Problem
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula φ(X,x) that is positive in X, it is decidable whether the fixed-point recursion based on φ is spurious over the class of all trees in the sense that there is some uniform finite bound for the number of iterations φ takes ...
متن کاملComplete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations of the monadic second-order logic (MSO), monadic transitive closure logic (FO(TC)) and monadic least fixed-point logic (FO(LFP)) theories of this cl...
متن کامل